Interleaving Natural Language Parsing and Generation through Uniform Processing
نویسندگان
چکیده
We present a new model of natural language processing in which natural language parsing and generation are strongly interleaved tasks. Interleaving of parsing and generation is important if we assume that natural language understanding and production are not only performed in isolation but also work together to obtain subsentential interactions in text revision or dialog systems. The core of the model is a new uniform agenda-driven tabular algorithm, called UTA. Although uniformly deened, UTA is able to conngure itself dynamically for either parsing or generation, because it is fully driven by the structure of the actual input|a string for parsing and a semantic expression for generation. EEcient interleaving of parsing and generation is obtained through item sharing between parsing and generation. This novel processing strategy facilitates the automatic exchange of items (i.e., partial results) computed in one direction to the other direction as well. The advantage of UTA in combination with the item sharing method is that we are able to extend the use of memorization techniques to the case of an inter-leaved approach. In order to demonstrate UTA's utility for developing high-level performance methods, we present a new algorithm for incremental self-monitoring during natural language production. (project bild) and from the German Bundesministerium f ur Bildung, Wissenschaft, Forschung und Technologie (BMB+F) to the DFKI projects disco (FKZ ITW 9002), paradice (FKZ ITW 9403) and paradime (FKZ ITW 9704). I would like to thank the following people for the fruitful discussions:
منابع مشابه
Interleaving Natural Language Parsing and Generation Through Uniform Processing
We present a new model of natural language processing in which natural lan guage parsing and generation are strongly interleaved tasks Interleaving of parsing and generation is important if we assume that natural language understanding and production are not only performed in isolation but also work together to obtain subsentential interactions in text revision or dialog systems The core of the...
متن کاملA Bidirectional Model For Natural Language Processing
In this paper* I will argue for a model of grammatical processing that is based on uniform processing and knowledge sources. The main feature of this model is to view parsing and generation as two strongly interleaved tasks performed by a single parametrized deduction process. It will be shown that this view supports flexible and efficient natural language processing.
متن کاملReversibility And Modularity In Natural Language Generation
A consequent use of reversible grammars within natural language generation systems has strong implications for the separation into strategic and tactical components. A central goal of this paper is to make plausible that a uniform architecture for grammatical Processing will serve as a basis to achieve more flexible and efficient generation systems. 1 Introduction In general, the goal of parsin...
متن کاملAlgorithms for Generation in Lambek Theorem Proving
We discuss algorithms for generation within the Lambek Theorem Proving Framework. Efficient algorithms for generation in this framework take a semantics-driven strategy. This strategy can be modeled by means of rules in the calculus that are geared to generation, or by means of an algorithm for the Theorem Prover. The latter possibility enables processing of a bidirectional calculus. Therefore ...
متن کامل